Combinatorial Voting
نویسندگان
چکیده
We study elections that simultaneously decide multiple issues, where voters have independent private values over bundles of issues. The innovation is considering nonseparable preferences, where issues may be complements or substitutes. Voters face a political exposure problem: the optimal vote for a particular issue will depend on the resolution of the other issues. Moreover, the probabilities that the other issues will pass should be conditioned on being pivotal. We first prove equilibrium exists when distributions over values have full support or when issues are complements. We then study limits of symmetric equilibria for large elections. Suppose that, conditioning on being pivotal for an issue, the outcomes of the residual issues are asymptotically certain. Then limit equilibria are determined by ordinal comparisons of bundles. We characterize when this asymptotic conditional certainty occurs. Using these characterizations, we construct a nonempty open set of distributions where the outcome of either issue remains uncertain in all limit equilibria. Thus, predictability of large elections is not a generic feature of independent private values. While the Condorcet winner is not necessarily the outcome of the election, we provides conditions that guarantee the implementation of the Condorcet winner. Finally, we prove results that suggest transitivity and ordinal separability of the majority preference relation are conducive for ordinal efficiency and for predictability.
منابع مشابه
Conditional and Sequential Approval Voting on Combinatorial Domains
Several methods exist for making collective decisions on a set of variables when voters possibly have preferential dependencies. None is based on approval voting. We define a family of rules for approval-based voting on combinatorial domains, where voters cast conditional approval ballots, allowing them to approve values of a variable conditionally on the values of other variables. We study thr...
متن کاملCombinatorial and computational aspects of multiple weighted voting games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملSettling the neutrality and efficiency of decomposable voting rules and correspondences
In this paper, we address the problem of the existence of neutral or effi-cient decomposable voting rules and correspondences on combinatorial do-mains, by extending the impossibility theorems about the neutrality and ef-ficiency of seat-by-seat voting rules in a recent paper of Benoit and Korn-hauser. Our contributions are the following: we identify the set of neutralrules ...
متن کاملComputational Voting Theory: Game-Theoretic and Combinatorial Aspects
Computer Science) Computational Voting Theory: Game-Theoretic and Combinatorial Aspects
متن کاملElectors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different (e.g., a dog and an elephant). We argue that the challenging part is the establishment of a sparse correspondence and show that it can be efficiently solved by considering the underlying skeletons augmented with intrin...
متن کاملVoting in Combinatorial Domains
This chapter addresses preference aggregation and voting on domains which are the Cartesian product (or sometimes, a subset of the Cartesian product) of finite domain values, each corresponding to an issue, a variable, or an attribute. As seen in other chapters of this handbook, voting rules map a profile (usually, a collection of rankings, see Chapter 1 (Zwicker, 2015)) into an alternative or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008